DARYN, A Distributed Decision-Making Algorithm for Railway Networks: Modeling and Simulation

نویسندگان

  • Rajesh V. Iyer
  • Sumit Ghosh
چکیده

The current state of the art in scheduling \point-to-point" trains in a railway network utilizes the principles of centralized decision-making. A point-to-point train refers to either a freight or a passenger carrying express train wherein the originating (A) and destination (B) stations are known a priori but the route between A and B may be ascertained dynamically based on a complex cost function. In centralized scheduling such as the ATCS 1] system, a dispatcher, implemented through a single powerful main-frame computer, receives, at appropriate intervals of time, the destination and current location and speed of every train and the statuses i.e., whether occupied or empty, of all tracks in the railway system. The dispatcher analyzes the data and determines, based on a given cost function, the most eecient routes, for the subsequent time interval, for every train in the system. The major diiculty of this approach is that the execution time and the memory requirements increase non-linearly as the system grows in size with more trains, tracks, and stations. This paper introduces a new approach, \DARYN", wherein the overall decision process is analyzed and distributed onto every natural entity of the system { trains and stations. In DARYN, the decision process for every train is executed by an on-board processor that negotiates, dynamically and progressively, for temporary ownership of the tracks with the respective station controlling the tracks, through explicit processor to processor communication primitives. This processor then computes its own route utilizing the results of its negotiation, its knowledge of the track layout of the entire system, and its evaluation of the cost function. Every station's decision process is also executed by a dedicated processor that, in addition, maintains absolute control over a given set of tracks and participates in the negotiation with the trains. Since the computational responsibility is distributed over all of the logical entities of the system, DARYN ooers the potential of superior performance over the traditional uniprocessor approach. In addition, as more trains and stations are added to the system, both the requirement for computational power and the number of computational engines increase. Assuming that a train's origin and destination is uncorrelated with that of any another train, the ratio of available computational power to the required computational power is expected to decrease only by a marginal fraction. Consequently, the time required by a train to travel from locations A to B at a given …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Demand Response Based Model for Optimal Decision Making for Distribution Networks

In this paper, a heuristic mathematical model for optimal decision-making of a Distribution Company (DisCo) is proposed that employs demand response (DR) programs in order to participate in a day-ahead market, taking into account elastic and inelastic load models. The proposed model is an extended responsive load modeling that is based on price elasticity and customers’ incentives in which they...

متن کامل

Optimum Local Decision Rules in a Distributed Detection System with Dependent Observations

The theory of distributed detection is receiving a lot of attention. A common assumption used in previous studies is the conditional independence of the observations. In this paper, the optimization of local decision rules for distributed detection networks with correlated observations is considered. We focus on presenting the detection theory for parallel distributed detection networks with fi...

متن کامل

Optimum Local Decision Rules in a Distributed Detection System with Dependent Observations

The theory of distributed detection is receiving a lot of attention. A common assumption used in previous studies is the conditional independence of the observations. In this paper, the optimization of local decision rules for distributed detection networks with correlated observations is considered. We focus on presenting the detection theory for parallel distributed detection networks with fi...

متن کامل

Distributed Incremental Least Mean-Square for Parameter Estimation using Heterogeneous Adaptive Networks in Unreliable Measurements

Adaptive networks include a set of nodes with adaptation and learning abilities for modeling various types of self-organized and complex activities encountered in the real world. This paper presents the effect of heterogeneously distributed incremental LMS algorithm with ideal links on the quality of unknown parameter estimation. In heterogeneous adaptive networks, a fraction of the nodes, defi...

متن کامل

Computational modeling of dynamic decision making using connectionist networks

In this research connectionist modeling of decision making has been presented. Important areas for decision making in the brain are thalamus, prefrontal cortex and Amygdala. Connectionist modeling with 3 parts representative for these 3 areas is made based the result of Iowa Gambling Task. In many researches Iowa Gambling Task is used to study emotional decision making. In these kind of decisio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007